Generating Sets of Permutations with Pattern Occurrence Counts Using πDDs
نویسندگان
چکیده
A pattern occurs in a permutation if there is a subsequence of the permutation with the same relative order as the pattern. For mathematical analysis of permutation patterns, strong Wilf-equivalence has been defined as the equivalence between permutation patterns based on the number of occurrences of a pattern. In this paper, we present an algorithm for generating permutations of length n in which a pattern σ occurs exactly k times. Our approach is based on permutation decision diagrams (πDDs), which can represent and manipulate permutation sets compactly and efficiently. According to computational experiments, we gives a conjecture: all strongly Wilf-equivalent classes are trivial.
منابع مشابه
Implicit Generation of Pattern-Avoiding Permutations Based on πDDs
Pattern-avoiding permutations are permutations where none of the subsequences match the relative order of a given pattern. Pattern-avoiding permutations are related to practical and abstract mathematical problems and can provide simple representations for such problems. For example, some floorplans, which are used for optimizing very-large-scale integration(VLSI) circuit design, can be encoded ...
متن کاملAn Efficient Method of Indexing All Topological Orders for a Given DAG
Topological orders of a directed graph are an important concept of graph algorithms. The generation of topological orders is useful for designing graph algorithms and solving scheduling problems. In this paper, we generate and index all topological orders of a given graph. Since topological orders are permutations of vertices, we can use the data structure πDD, which generates and indexes a set...
متن کاملRegular closed sets of permutations
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the first non-trivial examples of pattern closed sets of permutations all of whose closed subclasses ha...
متن کاملNon-Contiguous Pattern Avoidance in Binary Trees
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-con...
متن کاملGenerating trees for permutations avoiding generalized patterns
We construct generating trees with with one and two labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, instead of inserting always the largest entry. This allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. W...
متن کامل